Proof of a tiling conjecture of Komlós
نویسندگان
چکیده
A conjecture of Komlós states that for every graph H, there is a constant K such that if G is any n-vertex graph of minimum degree at least (1 (1/ cr(H)))n, where cr(H) denotes the critical chromatic number of H, then G contains an H-matching that covers all but at most K vertices of G. In this paper we prove that the conjecture holds for all sufficiently large values of n. © 2003 Wiley Periodicals, Inc. Random Struct. Alg., 23: 000–000, 2003
منابع مشابه
A short proof of the maximum conjecture in CR dimension one
In this paper and by means of the extant results in the Tanaka theory, we present a very short proof in the specific case of CR dimension one for Beloshapka's maximum conjecture. Accordingly, we prove that each totally nondegenerate model of CR dimension one and length >= 3 has rigidity. As a result, we observe that the group of CR automorphisms associated with each of such models contains onl...
متن کاملProof of the Loebl-Komlós-Sós conjecture for large, dense graphs
The Loebl–Komlós–Sós conjecture states that for any integers k and n, if a graph G on n vertices has at least n/2 vertices of degree at least k, then G contains as subgraphs all trees on k + 1 vertices. We prove this conjecture in the case when k is linear in n, and n is sufficiently large. © 2009 Elsevier B.V. All rights reserved.
متن کاملProof of the Bandwidth Conjecture of Bollobás and Komlós
In this paper we prove the following conjecture by Bollobás and Komlós: For every γ > 0 and integers r ≥ 1 and ∆, there exists β > 0 with the following property. If G is a sufficiently large graph with n vertices and minimum degree at least ((r− 1)/r+ γ)n and H is an r-chromatic graph with n vertices, bandwidth at most βn and maximum degree at most ∆, then G contains a copy of H.
متن کاملOn the Closed-Form Solution of a Nonlinear Difference Equation and Another Proof to Sroysang’s Conjecture
The purpose of this paper is twofold. First we derive theoretically, using appropriate transformation on x(n), the closed-form solution of the nonlinear difference equation x(n+1) = 1/(±1 + x(n)), n ∈ N_0. The form of solution of this equation, however, was first obtained in [10] but through induction principle. Then, with the solution of the above equation at hand, we prove a case ...
متن کاملOn the oriented perfect path double cover conjecture
An oriented perfect path double cover (OPPDC) of a graph $G$ is a collection of directed paths in the symmetric orientation $G_s$ of $G$ such that each arc of $G_s$ lies in exactly one of the paths and each vertex of $G$ appears just once as a beginning and just once as an end of a path. Maxov{'a} and Ne{v{s}}et{v{r}}il (Discrete Math. 276 (2004) 287-294) conjectured that ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Random Struct. Algorithms
دوره 23 شماره
صفحات -
تاریخ انتشار 2003